________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:27:13
Input Data from:  dataset127.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0626666666666667
Average f[i]   :4400
Average g[i,j] :2062,5
Total demand   :17180
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	1130	1	-1	5	4500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0    >new incumb.: 1130


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 29
> Selected Move:	2000	1	-1	2	10000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0    >new incumb.: 2000


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 35
> Selected Move:	2870	1	-1	4	15500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  0    >new incumb.: 2870


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 37
> Selected Move:	3500	1	-1	7	19500


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0    >new incumb.: 3500


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 33
> Selected Move:	3730	3	4	8	19500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0    >new incumb.: 3730


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 32
> Selected Move:	3660	3	8	9	20500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 21
> Selected Move:	3650	3	2	8	20500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 22
> Selected Move:	3550	3	9	3	20000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 24
> Selected Move:	3560	3	8	2	20000


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 30
> Selected Move:	3320	3	2	4	20000


> New Y[]: 
	
	 2  3  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 27
> Selected Move:	3490	3	3	8	19500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 31
> Selected Move:	3272	3	4	6	20500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 26
> Selected Move:	3285	3	8	2	20500


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 31
> Selected Move:	2875	3	2	3	21000


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 14 #######################


> Neighbours evaluated; 26
> Selected Move:	3200	3	6	9	21000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,475

## ITERATION 15 #######################


> Neighbours evaluated; 16
> Selected Move:	3232	3	3	4	20500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 16 #######################


> Neighbours evaluated; 27
> Selected Move:	3060	2	7	-1	16500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 17 #######################


> Neighbours evaluated; 34
> Selected Move:	3090	3	4	6	17500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 18 #######################


> Neighbours evaluated; 29
> Selected Move:	3040	3	6	7	15000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 19 #######################


> Neighbours evaluated; 28
> Selected Move:	2870	3	1	2	17000


> New Y[]: 
	
	 2  0  3  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,5

## ITERATION 20 #######################


> Neighbours evaluated; 19
> Selected Move:	2870	4	2	5	18200


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,505

## ITERATION 21 #######################


> Neighbours evaluated; 19
> Selected Move:	2870	4	5	7	18800


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,5

## ITERATION 22 #######################


> Neighbours evaluated; 17
> Selected Move:	2870	4	7	9	16100


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,495

## ITERATION 23 #######################


> Neighbours evaluated; 22
> Selected Move:	2938	1	-1	8	21600


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,49

## ITERATION 24 #######################


> Neighbours evaluated; 12
> Selected Move:	2951	3	9	3	21100


> New Y[]: 
	
	 2  0  1  3  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 25 #######################


> Neighbours evaluated; 19
> Selected Move:	2716	3	3	6	21100


> New Y[]: 
	
	 2  0  1  0  0  1  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 26 #######################


> Neighbours evaluated; 22
> Selected Move:	2860	2	7	-1	17100


> New Y[]: 
	
	 2  0  1  0  0  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,475

## ITERATION 27 #######################


> Neighbours evaluated; 26
> Selected Move:	2870	3	8	9	18100


> New Y[]: 
	
	 2  0  1  0  0  1  3  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  1 
 > pw :0,47

## ITERATION 28 #######################


> Neighbours evaluated; 20
> Selected Move:	2870	4	6	2	19500


> New Y[]: 
	
	 2  0  3  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  1 
 > pw :0,465

## ITERATION 29 #######################


> Neighbours evaluated; 16
> Selected Move:	2870	4	2	9	18600


> New Y[]: 
	
	 2  0  1  0  0  1  1  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  1 
 > pw :0,46

## ITERATION 30 #######################


> Neighbours evaluated; 21
> Selected Move:	2870	3	6	4	17600


> New Y[]: 
	
	 2  0  1  0  1  1  0  0  0  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,455

## ITERATION 31 #######################


> Neighbours evaluated; 22
> Selected Move:	2870	4	9	2	18500


> New Y[]: 
	
	 2  0  3  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,45

## ITERATION 32 #######################


> Neighbours evaluated; 19
> Selected Move:	2870	4	2	4	19000


> New Y[]: 
	
	 2  0  1  0  3  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,445

## ITERATION 33 #######################


> Neighbours evaluated; 17
> Selected Move:	2870	4	4	5	19700


> New Y[]: 
	
	 2  0  1  0  1  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,44

## ITERATION 34 #######################


> Neighbours evaluated; 20
> Selected Move:	2860	3	2	8	19700


> New Y[]: 
	
	 2  0  0  0  1  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,435

## ITERATION 35 #######################


> Neighbours evaluated; 19
> Selected Move:	2860	4	5	4	19000


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,43

## ITERATION 36 #######################


> Neighbours evaluated; 20
> Selected Move:	2860	4	4	8	18300


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,425

## ITERATION 37 #######################


> Neighbours evaluated; 18
> Selected Move:	2860	4	8	9	17600


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,42

## ITERATION 38 #######################


> Neighbours evaluated; 20
> Selected Move:	2860	3	4	6	18600


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  1 
 > pw :0,415

## ITERATION 39 #######################


> Neighbours evaluated; 18
> Selected Move:	2860	4	9	6	18100


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  1 
 > pw :0,41

## ITERATION 40 #######################


> Neighbours evaluated; 17
> Selected Move:	2860	4	6	8	19300


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  1 
 > pw :0,405

## ITERATION 41 #######################


> Neighbours evaluated; 15
> Selected Move:	2860	3	6	7	16800


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,4

## ITERATION 42 #######################


> Neighbours evaluated; 20
> Selected Move:	2860	4	8	5	18200


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,395

## ITERATION 43 #######################


> Neighbours evaluated; 17
> Selected Move:	2860	4	5	7	18800


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,39

## ITERATION 44 #######################


> Neighbours evaluated; 15
> Selected Move:	2860	4	7	9	16100


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,385

## ITERATION 45 #######################


> Neighbours evaluated; 19
> Selected Move:	2860	3	9	1	14000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 46 #######################


> Neighbours evaluated; 29
> Selected Move:	2870	3	8	2	14000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0 
 > pw :0,375

## ITERATION 47 #######################


> Neighbours evaluated; 28
> Selected Move:	2870	3	7	6	16500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 48 #######################


> Neighbours evaluated; 31
> Selected Move:	2990	1	-1	8	22000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 49 #######################


> Neighbours evaluated; 22
> Selected Move:	3365	3	6	4	21000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 50 #######################


> Neighbours evaluated; 31
> Selected Move:	3210	3	8	9	22000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 51 #######################


> Neighbours evaluated; 21
> Selected Move:	3210	3	2	8	22000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 52 #######################


> Neighbours evaluated; 17
> Selected Move:	3025	3	9	3	21500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 53 #######################


> Neighbours evaluated; 27
> Selected Move:	3028	3	8	2	21500


> New Y[]: 
	
	 2  3  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 54 #######################


> Neighbours evaluated; 28
> Selected Move:	3010	3	4	8	21500


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 55 #######################


> Neighbours evaluated; 25
> Selected Move:	3125	3	5	7	21000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 56 #######################


> Neighbours evaluated; 30
> Selected Move:	3145	3	3	9	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,375

## ITERATION 57 #######################


> Neighbours evaluated; 28
> Selected Move:	3043	3	9	4	20500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 58 #######################


> Neighbours evaluated; 33
> Selected Move:	2890	3	8	9	21500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 59 #######################


> Neighbours evaluated; 29
> Selected Move:	2873	3	2	8	21500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 60 #######################


> Neighbours evaluated; 24
> Selected Move:	2830	2	4	-1	16000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,395

## ITERATION 61 #######################


> Neighbours evaluated; 29
> Selected Move:	2840	3	8	2	16000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,4

## ITERATION 62 #######################


> Neighbours evaluated; 30
> Selected Move:	2840	3	0	5	18000


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,405

## ITERATION 63 #######################


> Neighbours evaluated; 25
> Selected Move:	2840	4	5	2	17500


> New Y[]: 
	
	 0  3  2  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,41

## ITERATION 64 #######################


> Neighbours evaluated; 24
> Selected Move:	2840	4	2	7	18100


> New Y[]: 
	
	 0  3  1  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,415

## ITERATION 65 #######################


> Neighbours evaluated; 22
> Selected Move:	2840	4	7	9	16400


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,41

## ITERATION 66 #######################


> Neighbours evaluated; 25
> Selected Move:	2921	1	-1	8	21900


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,405

## ITERATION 67 #######################


> Neighbours evaluated; 21
> Selected Move:	2830	2	2	-1	16400


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,4

## ITERATION 68 #######################


> Neighbours evaluated; 24
> Selected Move:	2830	4	9	5	18000


> New Y[]: 
	
	 0  3  0  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,395

## ITERATION 69 #######################


> Neighbours evaluated; 22
> Selected Move:	2830	4	5	7	18100


> New Y[]: 
	
	 0  3  0  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,39

## ITERATION 70 #######################


> Neighbours evaluated; 22
> Selected Move:	2830	4	7	8	17000


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,385

## ITERATION 71 #######################


> Neighbours evaluated; 22
> Selected Move:	2830	3	7	4	18500


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,38

## ITERATION 72 #######################


> Neighbours evaluated; 23
> Selected Move:	2840	3	8	2	19000


> New Y[]: 
	
	 0  3  2  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,375

## ITERATION 73 #######################


> Neighbours evaluated; 17
> Selected Move:	2840	4	2	4	18900


> New Y[]: 
	
	 0  3  1  0  2  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,37

## ITERATION 74 #######################


> Neighbours evaluated; 18
> Selected Move:	2840	4	4	5	19500


> New Y[]: 
	
	 0  3  1  0  1  2  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,365

## ITERATION 75 #######################


> Neighbours evaluated; 17
> Selected Move:	2840	4	5	9	17900


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  2 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,36

## ITERATION 76 #######################


> Neighbours evaluated; 20
> Selected Move:	2840	3	4	6	18900


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,355

## ITERATION 77 #######################


> Neighbours evaluated; 20
> Selected Move:	2860	3	9	8	18500


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 78 #######################


> Neighbours evaluated; 22
> Selected Move:	2860	4	8	2	19000


> New Y[]: 
	
	 0  3  2  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 79 #######################


> Neighbours evaluated; 21
> Selected Move:	2860	4	2	5	19500


> New Y[]: 
	
	 0  3  1  0  0  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 80 #######################


> Neighbours evaluated; 20
> Selected Move:	2860	4	5	6	17300


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 81 #######################


> Neighbours evaluated; 25
> Selected Move:	2860	3	6	0	15500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 82 #######################


> Neighbours evaluated; 27
> Selected Move:	3040	1	-1	9	22000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 83 #######################


> Neighbours evaluated; 24
> Selected Move:	2985	3	8	6	23000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 84 #######################


> Neighbours evaluated; 16
> Selected Move:	3010	3	2	7	21500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,315

## ITERATION 85 #######################


> Neighbours evaluated; 25
> Selected Move:	3005	3	7	8	23000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 86 #######################


> Neighbours evaluated; 16
> Selected Move:	2860	2	9	-1	16500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 87 #######################


> Neighbours evaluated; 27
> Selected Move:	2860	3	1	2	18500


> New Y[]: 
	
	 2  0  3  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 88 #######################


> Neighbours evaluated; 21
> Selected Move:	2860	4	2	5	19700


> New Y[]: 
	
	 2  0  1  0  0  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 89 #######################


> Neighbours evaluated; 21
> Selected Move:	2860	4	5	8	18300


> New Y[]: 
	
	 2  0  1  0  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 90 #######################


> Neighbours evaluated; 24
> Selected Move:	2820	3	6	4	17300


> New Y[]: 
	
	 2  0  1  0  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 91 #######################


> Neighbours evaluated; 27
> Selected Move:	2860	1	-1	7	21300


> New Y[]: 
	
	 2  0  1  0  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 92 #######################


> Neighbours evaluated; 21
> Selected Move:	3063	3	4	9	22300


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,295

## ITERATION 93 #######################


> Neighbours evaluated; 12
> Selected Move:	2993	4	8	2	22500


> New Y[]: 
	
	 2  0  3  0  0  1  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,3

## ITERATION 94 #######################


> Neighbours evaluated; 14
> Selected Move:	2920	3	2	3	22100


> New Y[]: 
	
	 2  0  0  3  0  1  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,305

## ITERATION 95 #######################


> Neighbours evaluated; 13
> Selected Move:	2920	3	8	2	22100


> New Y[]: 
	
	 2  0  1  3  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,31

## ITERATION 96 #######################


> Neighbours evaluated; 17
> Selected Move:	2909	4	3	9	22100


> New Y[]: 
	
	 2  0  1  1  0  1  0  1  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,315

## ITERATION 97 #######################


> Neighbours evaluated; 19
> Selected Move:	2956	3	3	4	21600


> New Y[]: 
	
	 2  0  1  0  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,32

## ITERATION 98 #######################


> Neighbours evaluated; 19
> Selected Move:	2938	3	2	8	21600


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 99 #######################


> Neighbours evaluated; 15
> Selected Move:	2868	3	4	3	22100


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,33

## ITERATION 100 #######################


> Neighbours evaluated; 15
> Selected Move:	2830	3	9	2	22000


> New Y[]: 
	
	 2  0  3  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 101 #######################


> Neighbours evaluated; 18
> Selected Move:	2887	4	2	8	21800


> New Y[]: 
	
	 2  0  1  1  0  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 102 #######################


> Neighbours evaluated; 21
> Selected Move:	2800	2	3	-1	15800


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 103 #######################


> Neighbours evaluated; 22
> Selected Move:	2820	3	7	9	18300


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 104 #######################


> Neighbours evaluated; 17
> Selected Move:	2840	3	8	1	16500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 105 #######################


> Neighbours evaluated; 19
> Selected Move:	2840	3	0	6	18300


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,36

## ITERATION 106 #######################


> Neighbours evaluated; 21
> Selected Move:	2840	4	6	2	20000


> New Y[]: 
	
	 0  3  2  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,365

## ITERATION 107 #######################


> Neighbours evaluated; 15
> Selected Move:	2830	3	2	8	19500


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,36

## ITERATION 108 #######################


> Neighbours evaluated; 16
> Selected Move:	2830	4	8	6	18300


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,355

## ITERATION 109 #######################


> Neighbours evaluated; 22
> Selected Move:	2830	4	6	9	18900


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,35

## ITERATION 110 #######################


> Neighbours evaluated; 19
> Selected Move:	2830	3	6	4	17900


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,345

## ITERATION 111 #######################


> Neighbours evaluated; 22
> Selected Move:	2860	3	9	0	15500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 112 #######################


> Neighbours evaluated; 26
> Selected Move:	2830	3	4	9	16500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 113 #######################


> Neighbours evaluated; 18
> Selected Move:	2830	3	0	4	18900


> New Y[]: 
	
	 0  3  0  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,33

## ITERATION 114 #######################


> Neighbours evaluated; 17
> Selected Move:	2830	4	4	5	19500


> New Y[]: 
	
	 0  3  0  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,325

## ITERATION 115 #######################


> Neighbours evaluated; 19
> Selected Move:	2830	3	5	0	17500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,32

## ITERATION 116 #######################


> Neighbours evaluated; 25
> Selected Move:	2840	3	8	2	17500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 117 #######################


> Neighbours evaluated; 28
> Selected Move:	2840	3	4	6	18500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 118 #######################


> Neighbours evaluated; 30
> Selected Move:	2860	3	9	8	17500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 119 #######################


> Neighbours evaluated; 30
> Selected Move:	2830	3	2	9	18500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 120 #######################


> Neighbours evaluated; 27
> Selected Move:	2820	3	6	2	17500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 121 #######################


> Neighbours evaluated; 25
> Selected Move:	2820	3	0	4	19900


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 122 #######################


> Neighbours evaluated; 16
> Selected Move:	2820	4	4	2	20000


> New Y[]: 
	
	 0  3  2  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,285

## ITERATION 123 #######################


> Neighbours evaluated; 16
> Selected Move:	2820	4	2	8	19500


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,28

## ITERATION 124 #######################


> Neighbours evaluated; 15
> Selected Move:	2820	4	8	9	18900


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,275

## ITERATION 125 #######################


> Neighbours evaluated; 19
> Selected Move:	2820	3	4	5	17900


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,27

## ITERATION 126 #######################


> Neighbours evaluated; 17
> Selected Move:	2820	4	9	2	19000


> New Y[]: 
	
	 0  3  2  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 127 #######################


> Neighbours evaluated; 15
> Selected Move:	2905	1	-1	7	23000


> New Y[]: 
	
	 0  3  2  0  0  1  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,26

## ITERATION 128 #######################


> Neighbours evaluated; 19
> Selected Move:	3050	4	2	8	22500


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,255

## ITERATION 129 #######################


> Neighbours evaluated; 21
> Selected Move:	2980	3	9	3	22000


> New Y[]: 
	
	 0  3  1  1  0  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 130 #######################


> Neighbours evaluated; 17
> Selected Move:	3065	4	8	3	21700


> New Y[]: 
	
	 0  3  1  2  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 131 #######################


> Neighbours evaluated; 23
> Selected Move:	2932	3	3	6	21300


> New Y[]: 
	
	 0  3  1  0  0  1  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 132 #######################


> Neighbours evaluated; 26
> Selected Move:	2905	3	8	9	22300


> New Y[]: 
	
	 0  3  1  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 133 #######################


> Neighbours evaluated; 22
> Selected Move:	2884	3	2	8	22300


> New Y[]: 
	
	 0  3  0  0  0  1  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 134 #######################


> Neighbours evaluated; 20
> Selected Move:	2758	3	6	3	22700


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,265

## ITERATION 135 #######################


> Neighbours evaluated; 20
> Selected Move:	2824	4	3	9	22400


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,27

## ITERATION 136 #######################


> Neighbours evaluated; 19
> Selected Move:	2937	3	3	4	21900


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,275

## ITERATION 137 #######################


> Neighbours evaluated; 19
> Selected Move:	2938	3	8	2	21900


> New Y[]: 
	
	 0  3  1  0  1  1  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,28

## ITERATION 138 #######################


> Neighbours evaluated; 22
> Selected Move:	2810	3	9	8	21500


> New Y[]: 
	
	 0  3  1  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 139 #######################


> Neighbours evaluated; 25
> Selected Move:	2820	2	7	-1	17500


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 140 #######################


> Neighbours evaluated; 21
> Selected Move:	2820	4	8	2	18000


> New Y[]: 
	
	 0  3  2  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 141 #######################


> Neighbours evaluated; 20
> Selected Move:	2820	4	2	4	17900


> New Y[]: 
	
	 0  3  1  0  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,3

## ITERATION 142 #######################


> Neighbours evaluated; 19
> Selected Move:	2820	4	4	5	18500


> New Y[]: 
	
	 0  3  1  0  1  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 143 #######################


> Neighbours evaluated; 20
> Selected Move:	2820	3	4	9	19500


> New Y[]: 
	
	 0  3  1  0  0  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,31

## ITERATION 144 #######################


> Neighbours evaluated; 12
> Selected Move:	2820	4	5	8	18500


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 145 #######################


> Neighbours evaluated; 14
> Selected Move:	2800	3	5	7	18000


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 146 #######################


> Neighbours evaluated; 15
> Selected Move:	2800	4	8	2	18500


> New Y[]: 
	
	 0  3  2  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 147 #######################


> Neighbours evaluated; 14
> Selected Move:	2800	4	2	7	19100


> New Y[]: 
	
	 0  3  1  0  0  0  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 148 #######################


> Neighbours evaluated; 13
> Selected Move:	2820	3	7	6	19300


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 149 #######################


> Neighbours evaluated; 13
> Selected Move:	2820	4	6	9	19900


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 150 #######################


> Neighbours evaluated; 15
> Selected Move:	2800	3	6	7	17400


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 151 #######################


> Neighbours evaluated; 14
> Selected Move:	2800	3	1	5	19600


> New Y[]: 
	
	 0  0  1  0  0  3  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,27

## ITERATION 152 #######################


> Neighbours evaluated; 14
> Selected Move:	2800	4	5	2	18400


> New Y[]: 
	
	 0  0  3  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,265

## ITERATION 153 #######################


> Neighbours evaluated; 16
> Selected Move:	2820	3	7	4	19900


> New Y[]: 
	
	 0  0  3  0  1  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,26

## ITERATION 154 #######################


> Neighbours evaluated; 15
> Selected Move:	2820	4	2	8	19700


> New Y[]: 
	
	 0  0  1  0  1  1  0  0  3  2 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,255

## ITERATION 155 #######################


> Neighbours evaluated; 14
> Selected Move:	2820	4	8	9	19600


> New Y[]: 
	
	 0  0  1  0  1  1  0  0  2  3 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,25

## ITERATION 156 #######################


> Neighbours evaluated; 13
> Selected Move:	2820	4	8	4	20000


> New Y[]: 
	
	 0  0  1  0  2  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,245

## ITERATION 157 #######################


> Neighbours evaluated; 14
> Selected Move:	2820	3	4	0	17600


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 158 #######################


> Neighbours evaluated; 18
> Selected Move:	2986	1	-1	4	23100


> New Y[]: 
	
	 2  0  1  0  1  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,235

## ITERATION 159 #######################


> Neighbours evaluated; 16
> Selected Move:	2899	3	9	3	22600


> New Y[]: 
	
	 2  0  1  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 160 #######################


> Neighbours evaluated; 27
> Selected Move:	2807	3	8	7	21100


> New Y[]: 
	
	 2  0  1  3  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 161 #######################


> Neighbours evaluated; 29
> Selected Move:	2808	3	2	9	22100


> New Y[]: 
	
	 2  0  0  3  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,22

## ITERATION 162 #######################


> Neighbours evaluated; 22
> Selected Move:	2944	3	3	8	22300


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 163 #######################


> Neighbours evaluated; 14
> Selected Move:	2920	3	4	3	22800


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,23

## ITERATION 164 #######################


> Neighbours evaluated; 17
> Selected Move:	2870	3	8	2	23000


> New Y[]: 
	
	 2  0  3  1  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,235

## ITERATION 165 #######################


> Neighbours evaluated; 16
> Selected Move:	2873	3	3	4	22500


> New Y[]: 
	
	 2  0  3  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 166 #######################


> Neighbours evaluated; 19
> Selected Move:	2870	3	9	8	21500


> New Y[]: 
	
	 2  0  3  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 167 #######################


> Neighbours evaluated; 25
> Selected Move:	2820	2	7	-1	17500


> New Y[]: 
	
	 2  0  3  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 168 #######################


> Neighbours evaluated; 24
> Selected Move:	2820	4	2	4	18000


> New Y[]: 
	
	 2  0  1  0  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 169 #######################


> Neighbours evaluated; 22
> Selected Move:	2820	4	4	5	18700


> New Y[]: 
	
	 2  0  1  0  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 170 #######################


> Neighbours evaluated; 24
> Selected Move:	2820	3	4	9	19700


> New Y[]: 
	
	 2  0  1  0  0  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 171 #######################


> Neighbours evaluated; 14
> Selected Move:	2820	4	5	2	18500


> New Y[]: 
	
	 2  0  3  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,27

## ITERATION 172 #######################


> Neighbours evaluated; 16
> Selected Move:	2820	3	5	4	19500


> New Y[]: 
	
	 2  0  3  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 173 #######################


> Neighbours evaluated; 20
> Selected Move:	2820	4	2	4	20000


> New Y[]: 
	
	 2  0  1  0  3  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 174 #######################


> Neighbours evaluated; 18
> Selected Move:	2820	4	4	8	19300


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 175 #######################


> Neighbours evaluated; 19
> Selected Move:	2820	4	8	9	18600


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 176 #######################


> Neighbours evaluated; 21
> Selected Move:	2820	3	4	6	19600


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 177 #######################


> Neighbours evaluated; 20
> Selected Move:	2820	4	9	6	19100


> New Y[]: 
	
	 2  0  1  0  0  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 178 #######################


> Neighbours evaluated; 21
> Selected Move:	2866	1	-1	5	23600


> New Y[]: 
	
	 2  0  1  0  0  1  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  1 
 > pw :0,235

## ITERATION 179 #######################


> Neighbours evaluated; 15
> Selected Move:	2987	3	8	7	22100


> New Y[]: 
	
	 2  0  1  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 180 #######################


> Neighbours evaluated; 19
> Selected Move:	2987	3	2	8	22100


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 181 #######################


> Neighbours evaluated; 17
> Selected Move:	2885	4	6	9	22600


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,22

## ITERATION 182 #######################


> Neighbours evaluated; 16
> Selected Move:	2908	3	8	2	22600


> New Y[]: 
	
	 2  0  1  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 183 #######################


> Neighbours evaluated; 20
> Selected Move:	2808	3	7	8	24100


> New Y[]: 
	
	 2  0  1  0  0  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  1 
 > pw :0,23

## ITERATION 184 #######################


> Neighbours evaluated; 12
> Selected Move:	2820	4	0	6	19400


> New Y[]: 
	
	 0  0  1  0  0  1  2  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,235

## ITERATION 185 #######################


> Neighbours evaluated; 14
> Selected Move:	2820	4	6	9	19500


> New Y[]: 
	
	 0  0  1  0  0  1  3  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,24

## ITERATION 186 #######################


> Neighbours evaluated; 14
> Selected Move:	2796	4	9	8	20100


> New Y[]: 
	
	 0  0  1  0  0  1  3  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,245

## ITERATION 187 #######################


> Neighbours evaluated; 15
> Selected Move:	2796	4	6	8	20100


> New Y[]: 
	
	 0  0  1  0  0  1  2  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,25

## ITERATION 188 #######################


> Neighbours evaluated; 13
> Selected Move:	2800	3	6	7	19900


> New Y[]: 
	
	 0  0  1  0  0  1  0  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,255

## ITERATION 189 #######################


> Neighbours evaluated; 13
> Selected Move:	2800	4	7	2	19300


> New Y[]: 
	
	 0  0  2  0  0  1  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,26

## ITERATION 190 #######################


> Neighbours evaluated; 13
> Selected Move:	2800	4	2	5	19800


> New Y[]: 
	
	 0  0  1  0  0  2  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,265

## ITERATION 191 #######################


> Neighbours evaluated; 12
> Selected Move:	2800	4	5	9	18200


> New Y[]: 
	
	 0  0  1  0  0  1  0  1  3  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,26

## ITERATION 192 #######################


> Neighbours evaluated; 10
> Selected Move:	2800	4	8	9	18100


> New Y[]: 
	
	 0  0  1  0  0  1  0  1  2  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,255

## ITERATION 193 #######################


> Neighbours evaluated; 14
> Selected Move:	2800	4	8	2	18600


> New Y[]: 
	
	 0  0  2  0  0  1  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,25

## ITERATION 194 #######################


> Neighbours evaluated; 12
> Selected Move:	2800	4	2	5	19100


> New Y[]: 
	
	 0  0  1  0  0  2  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,245

## ITERATION 195 #######################


> Neighbours evaluated; 11
> Selected Move:	2800	4	5	7	19200


> New Y[]: 
	
	 0  0  1  0  0  1  0  2  1  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,24

## ITERATION 196 #######################


> Neighbours evaluated; 10
> Selected Move:	2800	3	9	1	17100


> New Y[]: 
	
	 0  3  1  0  0  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 197 #######################


> Neighbours evaluated; 20
> Selected Move:	2854	1	-1	9	23600


> New Y[]: 
	
	 0  3  1  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,23

## ITERATION 198 #######################


> Neighbours evaluated; 13
> Selected Move:	2895	4	7	5	23500


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,225

## ITERATION 199 #######################


> Neighbours evaluated; 16
> Selected Move:	2815	3	9	3	23000


> New Y[]: 
	
	 0  3  1  1  0  2  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,22

## ITERATION 200 #######################


> Neighbours evaluated; 20
> Selected Move:	2940	4	5	2	22500


> New Y[]: 
	
	 0  3  2  1  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,215

## ITERATION 201 #######################


> Neighbours evaluated; 21
> Selected Move:	2824	4	2	7	23100


> New Y[]: 
	
	 0  3  1  1  0  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,22

## ITERATION 202 #######################


> Neighbours evaluated; 24
> Selected Move:	2824	3	7	6	23300


> New Y[]: 
	
	 0  3  1  1  0  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 203 #######################


> Neighbours evaluated; 22
> Selected Move:	2845	3	3	9	23800


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,23

## ITERATION 204 #######################


> Neighbours evaluated; 15
> Selected Move:	2751	4	1	2	20300


> New Y[]: 
	
	 0  0  3  0  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,235
________________________________________________________________

Best solution found: 3730
Run Termination time: 03.02.2010 20:27:54
Run duration: 00:00:41.4531250
________________________________________________________________
